Quantum Computing with Differentiable Quantum Transforms
نویسندگان
چکیده
We present a framework for differentiable quantum transforms. Such transforms are metaprograms capable of manipulating programs in way that preserves their differentiability. highlight potential with set relevant examples across computing (gradient computation, circuit compilation, and error mitigation), implement them using the transform PennyLane, software library programming. In this framework, themselves can be parametrized optimized, which opens up possibility improved resource requirements spectrum tasks.
منابع مشابه
Quantum computing and a unified approach to fast unitary transforms
A quantum computer directly manipulates information stored in the state of quantum mechanical systems. The available operations have many attractive features but also underly severe restrictions, which complicate the design of quantum algorithms. We present a divide-and-conquer approach to the design of various quantum algorithms. The class of algorithm includes many transforms which are well-k...
متن کاملQuantum current modeling in nano-transistors with a quantum dot
Carbon quantum dots (CQDs) serve as a new class of ‘zero dimensional’ nanomaterial’s in thecarbon class with sizes below 10 nm. As light emitting nanocrystals, QDs are assembled from semiconductormaterials, from the elements in the periodic groups of II-VI, III-V or IV-VI, mainly thanks to impacts of quantum confinement QDs have unique optical properties such as brighter, highly pho...
متن کاملQuantum computing with quantum-dot cellular automata
Quantum-dot cellular automata ~QCA!, arrays of coupled quantum-dot devices, are proposed for quantum computing. The notion of coherent QCA ~CQCA! is introduced in order to distinguish QCA applied to quantum computing from classical digital QCA. Information is encoded in the spatial state of the electrons in the multidot system. A line of CQCA cells can work as a quantum register. The basic sing...
متن کاملQuantum Time-Frequency Transforms
Time-frequency transforms represent a signal as a mixture of its time domain representation and its frequency domain representation. We present efficient algorithms for the quantum Zak transform and quantum Weyl-Heisenberg transform.
متن کاملEfficient Quantum Transforms
Quantum mechanics requires the operation of quantum computers to be unitary, and thus makes it important to have general techniques for developing fast quantum algorithms for computing unitary transforms. A quantum routine for computing a generalized Kronecker product is given. Applications include re-development of the networks for computing the Walsh-Hadamard and the quantum Fourier transform...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM transactions on quantum computing
سال: 2023
ISSN: ['2643-6817', '2643-6809']
DOI: https://doi.org/10.1145/3592622